package Week2.J0423;

import java.util.Scanner;

public class 求最小公倍数 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        long a = scanner.nextInt();
        long b = scanner.nextInt();
        if (a % b == 0 || b % a == 0) {
            System.out.println(Math.max(a, b));
            return;
        }

        for (int i = 2; i < Math.max(a, b); i++) {
            if (a * i % b == 0) {
                System.out.println(a*i);
                return;
            }
            if (b * i % a == 0) {
                System.out.println(b*i);
                return;
            }
        }
    }
}
